Перевод: со всех языков на русский

с русского на все языки

fast algorithm

См. также в других словарях:

  • FAST TCP — is a new TCP congestion avoidance algorithm especially targeted at high speed, long distance links, developed at the [http://netlab.caltech.edu/ Netlab] , California Institute of Technology and now being commercialized by [http://www.fastsoft.com …   Wikipedia

  • Fast retransmit — is an enhancement to TCP which reduces the time a sender waits before retransmitting a lost segment.A TCP sender uses timers to recognize lost segments. If an acknowledgement is not received for a particular segment within a specified time (a… …   Wikipedia

  • Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • Fast Folding Algorithm — The Fast Folding Algorithm (Staelin, 1969) in signal processing is an efficient algorithm for the detection of approximately periodic events within time series data. It computes superpositions of the signal modulo various window sizes… …   Wikipedia

  • Fast Data Encipherment Algorithm — FEAL Eine Feistel Runde von FEAL Entwickler Akihiro Shimizu und Shoji Miyaguchi, beide von NTT Veröffentlicht FEAL 4 1987; FEAL N/NX 1990 Schlüssellänge 64 Bit (FEAL), 128 Bits (F …   Deutsch Wikipedia

  • Fast Walsh–Hadamard transform — In computational mathematics, the Hadamard ordered fast Walsh–Hadamard transform (FWHTh) is an efficient algorithm to compute the Walsh–Hadamard transform (WHT). A naive implementation of the WHT would have a computational complexity of O(N^2).… …   Wikipedia

  • Fast Fourier Transform — Transformée de Fourier rapide La transformée de Fourier rapide (sigle anglais : FFT ou Fast Fourier Transform) est un algorithme de calcul de la transformée de Fourier discrète (TFD). Sa complexité varie en avec le nombre de points n, alors… …   Wikipédia en Français

  • Fast Multipole Method — The Fast Multipole Method (FMM) is a mathematical technique that was developed to speed up the calculation of long ranged forces in the n body problem. It does this by expanding the system Green s function using a multipole expansion, which… …   Wikipedia

  • Fast-Fourier-Transformation — Die schnelle Fourier Transformation (englisch fast Fourier transform, daher meist FFT abgekürzt) ist ein Algorithmus zur effizienten Berechnung der Werte einer diskreten Fourier Transformation (DFT). Bei dem Algorithmus handelt es sich um ein… …   Deutsch Wikipedia

  • Fast Fourier-Transformation — Die schnelle Fourier Transformation (englisch fast Fourier transform, daher meist FFT abgekürzt) ist ein Algorithmus zur effizienten Berechnung der Werte einer diskreten Fourier Transformation (DFT). Bei dem Algorithmus handelt es sich um ein… …   Deutsch Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»